On relaxing the Mangasarian–Fromovitz constraint qualification
نویسندگان
چکیده
منابع مشابه
Constraint qualification failure in action
This note presents a theoretical analysis of disjunctive constraints featuring unbounded variables. In this framework, classical modeling techniques, including big-M approaches, are not applicable. We introduce a lifted second-order cone formulation of such on/off constraints and discuss related constraint qualification issues. A solution is proposed to avoid solvers’ failure.
متن کاملImplications of the constant rank constraint qualification
An example in which CRCQ holds. The left figure shows a set S(u) defined by 3 constraints. The normal cone NS(u)(x) is the cone generated by the two dashed halflines originated from the point x. The red curve indicates the neighborhood X. The normal cone NS(u)(x) has four nonempty faces, and the family {I(x′, u), x′ ∈ S(u)∩X} contains four elements {1, 3},{1},{3} and ∅, each of which correspond...
متن کاملOn Set Containment Characterization and Constraint Qualification for Quasiconvex Programming
Dual characterizations of the containment of a convex set with quasiconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint qualification is the weakest constraint qualification for the duality.
متن کاملDuality without constraint qualification in nonsmooth optimization
We are concerned with a nonsmooth multiobjective optimization problem with inequality constraints. In order to obtain our main results, we give the definitions of the generalized convex functions based on the generalized directional derivative. Under the above generalized convexity assumptions, sufficient and necessary conditions for optimality are given without the need of a constraint qualifi...
متن کاملImproving Piecewise-linear Approximation by Relaxing on End Point Constraint
We consider the problem of approximating a polygonal curve P with n vertices by a sequence Q of m line segments, where m ≤ n−1. The goal is to minimize the error between P and Q under certain metric. Previously the problem was solved by constraining the line segments of Q to be sequentially connected and their end points be from P . In this paper we remove the end point constraint to achieve a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Positivity
سال: 2013
ISSN: 1385-1292,1572-9281
DOI: 10.1007/s11117-013-0238-4